Parallel Ant Colony Optimization: Algorithmic Models and Hardware Implementations
نویسنده
چکیده
The Ant Colony Optimization (ACO) metaheuristic [1] is a constructive population-based approach based on the social behavior of ants. As it is acknowledged as a powerful method to solve academic and industrial combinatorial optimization problems, a considerable amount of research is dedicated to improving its performance. Among the proposed solutions, we find the use of parallel computing to reduce computation time, improve solution quality or both.
منابع مشابه
Analysis of Parallel Implementations of the Ant Colony Optimization Applied to the Minimum Weight Vertex Cover Problem
In this paper we analyze various parallel implementations of the Ant Colony Optimization (ACO) applied to the Minimum Weight Vertex Cover Problem (MWVCP). We investigated the ACO algorithms applied to the MWCVP before. Here, we observe the behavior of different parallel topologies and corresponding algorithms like fully connected, replace worst, ring and independent parallel runs. We also prese...
متن کاملTabu Search with two approaches to parallel flowshop evaluation on CUDA platform
The introduction of NVidia’s powerful Tesla GPU hardware and Compute Unified Device Architecture (CUDA) platform enable many-core parallel programming. As a result, existing algorithms implemented on a GPU can run many times faster than on modern CPUs. Relatively little research has been done so far on GPU implementations of discrete optimisation algorithms. In this paper, two approaches to par...
متن کاملEstimation of Global Solar Irradiance Using a Novel combination of Ant Colony Optimization and Empirical Models
In this paper, a novel approach for the estimation of global solar irradiance is proposed based on a combination of empirical correlation and ant colony optimization. Empirical correlation has been used to estimate monthly average of daily global solar irradiance on a horizontal surface. The Ant Colony Optimization (ACO) algorithm has been applied as a swarm-intelligence technique to tune the c...
متن کاملA Distributed Multilevel Ant Colonies Approach for Graph Partitioning
The paper presents a distributed implementations of an ant colony optimization metaheuristic for the solution of a mesh partitioning problem. The usefulness and efficiency of the algorithm, in its sequential form, to solve that particular optimization problem has already been shown in previous work. In this paper a straightforward implementations on a distributed architecture is presented and t...
متن کاملA Distributed Multilevel Ant Colonies Approach
The paper presents a distributed implementations of an ant colony optimization metaheuristic for the solution of a mesh partitioning problem. The usefulness and efficiency of the algorithm, in its sequential form, to solve that particular optimization problem has already been shown in previous work. In this paper a straightforward implementations on a distributed architecture is presented and t...
متن کامل